TheDoxa of Reading andrew goldstone
ثبت نشده
چکیده
Reading Graphs, Maps, Trees as a late-stage graduate student in 2008 was invigorating.1 Here was an approach to literary history free from the pieties of “close reading,” committed to empiricism, seeking to fulfill the promise of the sociology of literature with its “materialist conception of form” (92). And, at the time, it seemed entirely natural that the way to follow the path laid out by Franco Moretti in Graphs and in the essays he had published over the previous decade was to go to my computer, polish my rusty programming skills, and start making graphs. Yet reconsidering Distant Reading now, it is striking how non-digital the book is. In fact, the term “distant reading” has undergone a rapid semantic transformation. In “Conjectures on World Literature,” originally published in 2000, Moretti introduces the phrase to describe “a patchwork of other people’s research, without a single direct textual reading” (Distant 48). Today, however, “distant reading” typically refers to computational studies of text. Introducing a 2016 cluster of essays on “Text Analysis at Scale,” Matthew Gold and Lauren Klein speak of “using digital tools to ‘read’ large swaths of text” as “ ‘distant reading’ ” (Introduction); in his contribution there, Ted Underwood embraces “distant reading” as a name for applying machine learning techniques to unstructured text (“Distant Reading”). Discussions of distant reading have become discussions of computation with text, even if no section of Distant Reading features the elaborate computations found in the Stanford Literary Lab pamphlets to whichMoretti has contributed. The semantic shift takes about ten years. At first—judging from the 190odd results for the phrase in a JSTOR search in early 2017—invocations of the term are concentrated in debates about world literature (e.g., Mufti 487). But soon enough, computers enter the picture: in 2007, AnaMitrić published
منابع مشابه
Perceptual Unitization in Part-Whole Judgments
Categorization relies upon the vocabulary of features that comprise the target objects. Previous theoretical work (Schyns, Goldstone, & Thibaut, 1998) has argued this vocabulary may change through learning and experience. Goldstone (2000) demonstrated this perceptual learning during a categorization task when new features are added that create a single feature unit from multiple existing units....
متن کاملCLINICAL TRIALS AND OBSERVATIONS UKALLXII/ECOG2993: addition of imatinib to a standard treatment regimen enhances long-term outcomes in Philadelphia positive acute lymphoblastic leukemia
Patel, Elisabeth Paietta, Martin S. Tallman and Anthony H. Goldstone Hillard Lazarus, Selina M. Luger, David I. Marks, Andrew K. McMillan, Anthony V. Moorman, Bella Adele K. Fielding, Jacob M. Rowe, Georgina Buck, Letizia Foroni, Gareth Gerrard, Mark R. Litzow, lymphoblastic leukemia regimen enhances long-term outcomes in Philadelphia positive acute UKALLXII/ECOG2993: addition of imatinib to a ...
متن کاملSimulating Time-Course Phenomena in Perceptual Similarity via Incremental Encoding
If people are required to respond very quickly in a samedifferent task, their judgments of sameness are heavily reliant on attribute matches, despite the fact that when given ample time, the judgments seem to rely chiefly on relational matches (Goldstone & Medin, 1994). One interpretation of this temporal pattern is that attribute matches enter into the comparison process before relational matc...
متن کاملExotic Goldstone Particles: Pseudo-Goldstone Boson and Goldstone Fermion
This essay describes two exotic Goldstone particles. One is the pseudoGoldstone boson which is related to spontaneous breaking of an approximate symmetry. The other is the Goldstone fermion which is a natural result of spontaneously broken global supersymmetry. Their realization and implication in high energy physics are examined.
متن کاملQuantum search by measurement
We propose a quantum algorithm for solving combinatorial search problems that uses only a sequence of measurements. The algorithm is similar to quantum computation by adiabatic evolution, in that the goal is to remain in the ground state of a time-varying Hamiltonian. Indeed, we show that the running times of the two algorithms are closely related. We also show how to achieve the quadratic spee...
متن کامل